Efficient Algorithms for Semantic Unification
نویسندگان
چکیده
The problem of matching vague terms must be addressed in knowledge-based systems involving uncertainty. Fril is a logic programming language extended by an integrated set of features for handling uncertain knowledge, based on the theoretical foundations provided by Baldwin’s mass assignment theory. This combines probabilistic and fuzzy uncertainty into a single framework. One of the fundamental operations in Fril is an extension to unification in which both terms are fuzzy and execution requires the calculation of a support for the conditional probability of the match. This is known as semantic unification. We outline algorithms for the calculation of interval and point value supports in the discrete and continuous cases.
منابع مشابه
Presentation of an efficient automatic short answer grading model based on combination of pseudo relevance feedback and semantic relatedness measures
Automatic short answer grading (ASAG) is the automated process of assessing answers based on natural language using computation methods and machine learning algorithms. Development of large-scale smart education systems on one hand and the importance of assessment as a key factor in the learning process and its confronted challenges, on the other hand, have significantly increased the need for ...
متن کاملPresentation of an efficient automatic short answer grading model based on combination of pseudo relevance feedback and semantic relatedness measures
Automatic short answer grading (ASAG) is the automated process of assessing answers based on natural language using computation methods and machine learning algorithms. Development of large-scale smart education systems on one hand and the importance of assessment as a key factor in the learning process and its confronted challenges, on the other hand, have significantly increased the need for ...
متن کاملPacking of Feature Structures for Efficient Unification of Disjunctive Feature Structures
This paper proposes a method for packing feature structures, which automatically collapses equivalent parts of lexical/phrasal feature structures of HPSG into a single packed feature structure. This method avoids redundant repetition of unification of those parts. Preliminary experiments show that this method can significantly improve a unification speed in parsing. 1 I n t r o d u c t i o n Ef...
متن کاملYet Another Efficient Unification Algorithm
The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [4] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.
متن کاملSemantic Tableaux with Equality
This paper tries to identify the basic problems encountered in handling equality in the semantic tableau framework, and to describe the state of the art in solving these problems. The two main paradigms for handling equality are compared: adding new tableau expansion rules and using E-unification algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996